How to Define Simulated Annealing for Optimality Theory?
نویسندگان
چکیده
Optimality Theory (OT) requires an algorithm optimising the Harmony function on the set of candidates. Simulated annealing, a well-known heuristic technique for combinatorial optimisation, has been argued to be an empirically adequate solution to this problem. In order to generalise simulated annealing for a non-real valued Harmony function, two representations of a violation profile are proposed: by using polynomials and ordinal numbers.
منابع مشابه
When the Hothead Speaks. Simulated Annealing Optimality Theory for Dutch Fast Speech
Simulated Annealing, a wide-spread technique for combinatorial optimisation, is employed to find the optimal candidate in a candidate set, as defined in Optimality Theory (OT). Being a heuristic techniques, simulated annealing does not guarantee to return the correct solution, and yet, some result is always returned within a constant time. Similarly to language production, this time framework c...
متن کاملElephants and Optimality Again
Children display a surprising delay in correctly resolving pronouns, while they employ Chomsky’s binding principles correctly in production and in resolving reflexives. We account for the mistakes as performance errors that are predicted by an Optimality Theoretical model implemented using simulated annealing. Our experiments suggest three novel explanations of the facts. Additionally, the Opti...
متن کاملSequencing Mixed Model Assembly Line Problem to Minimize Line Stoppages Cost by a Modified Simulated Annealing Algorithm Based on Cloud Theory
This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...
متن کاملA Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
متن کاملExperiments To Determine The Simulated Annealing Parameters Case Study In VRP
In this paper we describe the distribution problems faced by one of the largest retailers in the distribution and sale of fast moving consumer goods in the U.K. The paper describes an initial solution method, which is then improved by a novel form of simulated annealing. A computational experiment for the improvement algorithm has been also carried out in order to illustrate the flexibility of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005